CS264: Homework #6 Due by midnight on Wednesday, November 5, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should complete both t

Source URL: theory.stanford.edu

CANONICAL SUBGROUPS VIA BREUIL-KISIN MODULES SHIN HATTORI Abstract. Let p > 2 be a rational prime and K/Qp be an extension of complete discrete valuation fields. Let G be a truncated BarsottiTate group of level n, heigh

Source URL: www2.math.kyushu-u.ac.jp

• Algebra
• Abstract algebra
• Mathematics
• Group theory
• Divisor
• Morphism of schemes
• Vector bundle
• Sheaf
• Order
• Algebraic geometry
• Isomorphism theorem

Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved

Source URL: mug.mvapich.cse.ohio-state.edu

• Graph theory
• Mathematics
• Search algorithms
• Graph traversal
• Breadth-first search
• Vertex
• NP-complete problems
• Graph coloring
• Planar graphs
• Depth-first search

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

Source URL: www.mancoosi.org

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Operations research
• Logic in computer science
• Mathematical optimization
• NP-complete problems
• Boolean algebra
• Maximum satisfiability problem
• Boolean satisfiability problem
• Constraint satisfaction
• Solver

Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada

Source URL: rutcor.rutgers.edu

• Graph theory
• Bipartite graphs
• Planar graphs
• Induced path
• NP-complete problems
• Parity graph

A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012

Source URL: www.daviddelaat.nl

• Graph theory
• Mathematics
• NP-complete problems
• Information theory
• Combinatorial optimization
• NP-hard problems
• Lovsz number
• Independent set

Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer

Source URL: disco.ethz.ch

• Computational complexity theory
• Complexity classes
• NP-complete problems
• Operations research
• Combinatorial optimization
• Mathematical optimization
• Knapsack problem
• Reduction
• Graph coloring
• NP-hardness
• NP
• Optimization problem

A Fresh Look on Knowledge Bases: Distilling Named Events from News Erdal Kuzey Jilles Vreeken

Source URL: eda.mmci.uni-saarland.de

• Graph theory
• Mathematics
• NP-complete problems
• Network theory
• Networks
• Combinatorial optimization
• Semantic similarity
• Line graph
• Centrality
• Matching
• Dominating set
• Graph partition

TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems

Source URL: www.ads.tuwien.ac.at

• Graph theory
• Operations research
• Mathematics
• Computational complexity theory
• Network flow
• NP-complete problems
• NP-hard problems
• Travelling salesman problem
• Multi-commodity flow problem
• Flow network

Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

Source URL: students.ceid.upatras.gr

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Electronic design automation
• Symposium on Discrete Algorithms
• Approximation algorithm
• Random walk
• 2-satisfiability